Integer program with bimodular matrix
نویسندگان
چکیده
Let A be an m × n integral matrix of rank n. We say that A is bimodular if the maximum of the absolute values of the n×n minors is at most 2. We give a polynomial time algorithm that finds an integer solution for system Ax ≤ b. A polynomial time algorithm for integer program max{cx : Ax ≤ b} is constructed proceeding on some assumptions.
منابع مشابه
1 5 M ay 2 00 8 Integer program with bimodular matrix
We use the following notation: if A is a matrix, A i denotes its i-th row, a i,j is the entry at row i and column j, ∆ k (A) is the maximum of the absolute values of the k × k minors of A; if b is a vector then b i denotes its i-th coordinate. Let ⌊α⌋ denote the largest integer less than or equal to α. The transpose of a matrix A is denoted by A T. We say that A ∈ Z m×n is bimodular if rank A =...
متن کاملOn integer program with bounded minors and flatness theorem
Let A be an m × n integral matrix of rank n. We say that A has bounded minors if the maximum of the absolute values of the n × n minors is at most k, where k is a some natural constant. We will call that matrices like k-modular. We investigate an integer program max{cx : Ax ≤ b, x ∈ Zn} where A is k-modular. We say that A is almost unimodular (see [2, 5]) if it is 2-modular and the absolute val...
متن کاملA bimodular theory for finite deformations: Comparison of orthotropic second-order and exponential stress constitutive equations for articular cartilage.
Cartilaginous tissues, such as articular cartilage and the annulus fibrosus, exhibit orthotropic behavior with highly asymmetric tensile-compressive responses. Due to this complex behavior, it is difficult to develop accurate stress constitutive equations that are valid for finite deformations. Therefore, we have developed a bimodular theory for finite deformations of elastic materials that all...
متن کاملTheory of Integer Programming
Suppose that we have a linear program max{cx : Ax ≤ b, x ≥ 0} (P) where A is an m × n matrix, c an n-dimensional row vector, b an m-dimensional column vector, and x an n-dimensional column vector of variables. Now, we add in the restriction that some of the variables in (P) must take integer values. If some but not all variables are integer, we have a Mixed Integer Program (MIP), written as max...
متن کاملSensitivity theorems in integer linear programming
We consider integer linear programming problems with a fixed coefficient matrix and varying objective function and right-hand-side vector. Among our results, we show that, for any optimal solution to a linear program max{wx: Ax <~ b}, the distance to the nearest optimal solution to the corresponding integer program is at most the dimension of the problem multiplied by the largest subdeterminant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 6 شماره
صفحات -
تاریخ انتشار 2009